The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF).

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

U11(tt, V1, V2) → U12(isNatKind(activate(V1)), activate(V1), activate(V2))
U12(tt, V1, V2) → U13(isNatKind(activate(V2)), activate(V1), activate(V2))
U13(tt, V1, V2) → U14(isNatKind(activate(V2)), activate(V1), activate(V2))
U14(tt, V1, V2) → U15(isNat(activate(V1)), activate(V2))
U15(tt, V2) → U16(isNat(activate(V2)))
U16(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V2) → U32(isNatKind(activate(V2)))
U32(tt) → tt
U41(tt) → tt
U51(tt, N) → U52(isNatKind(activate(N)), activate(N))
U52(tt, N) → activate(N)
U61(tt, M, N) → U62(isNatKind(activate(M)), activate(M), activate(N))
U62(tt, M, N) → U63(isNat(activate(N)), activate(M), activate(N))
U63(tt, M, N) → U64(isNatKind(activate(N)), activate(M), activate(N))
U64(tt, M, N) → s(plus(activate(N), activate(M)))
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNatKind(activate(V1)), activate(V1), activate(V2))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatKind(n__0) → tt
isNatKind(n__plus(V1, V2)) → U31(isNatKind(activate(V1)), activate(V2))
isNatKind(n__s(V1)) → U41(isNatKind(activate(V1)))
plus(N, 0) → U51(isNat(N), N)
plus(N, s(M)) → U61(isNat(M), M, N)
0 → n__0
plus(X1, X2) → n__plus(X1, X2)
s(X) → n__s(X)
activate(n__0) → 0
activate(n__plus(X1, X2)) → plus(X1, X2)
activate(n__s(X)) → s(X)
activate(X) → X

Rewrite Strategy: FULL

(1) RenamingProof (EQUIVALENT transformation)

Renamed function symbols to avoid clashes with predefined symbol.

(2) Obligation:

Runtime Complexity Relative TRS:
The TRS R consists of the following rules:

U11(tt, V1, V2) → U12(isNatKind(activate(V1)), activate(V1), activate(V2))
U12(tt, V1, V2) → U13(isNatKind(activate(V2)), activate(V1), activate(V2))
U13(tt, V1, V2) → U14(isNatKind(activate(V2)), activate(V1), activate(V2))
U14(tt, V1, V2) → U15(isNat(activate(V1)), activate(V2))
U15(tt, V2) → U16(isNat(activate(V2)))
U16(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V2) → U32(isNatKind(activate(V2)))
U32(tt) → tt
U41(tt) → tt
U51(tt, N) → U52(isNatKind(activate(N)), activate(N))
U52(tt, N) → activate(N)
U61(tt, M, N) → U62(isNatKind(activate(M)), activate(M), activate(N))
U62(tt, M, N) → U63(isNat(activate(N)), activate(M), activate(N))
U63(tt, M, N) → U64(isNatKind(activate(N)), activate(M), activate(N))
U64(tt, M, N) → s(plus(activate(N), activate(M)))
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNatKind(activate(V1)), activate(V1), activate(V2))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatKind(n__0) → tt
isNatKind(n__plus(V1, V2)) → U31(isNatKind(activate(V1)), activate(V2))
isNatKind(n__s(V1)) → U41(isNatKind(activate(V1)))
plus(N, 0') → U51(isNat(N), N)
plus(N, s(M)) → U61(isNat(M), M, N)
0' → n__0
plus(X1, X2) → n__plus(X1, X2)
s(X) → n__s(X)
activate(n__0) → 0'
activate(n__plus(X1, X2)) → plus(X1, X2)
activate(n__s(X)) → s(X)
activate(X) → X

S is empty.
Rewrite Strategy: FULL

(3) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)

Infered types.

(4) Obligation:

TRS:
Rules:
U11(tt, V1, V2) → U12(isNatKind(activate(V1)), activate(V1), activate(V2))
U12(tt, V1, V2) → U13(isNatKind(activate(V2)), activate(V1), activate(V2))
U13(tt, V1, V2) → U14(isNatKind(activate(V2)), activate(V1), activate(V2))
U14(tt, V1, V2) → U15(isNat(activate(V1)), activate(V2))
U15(tt, V2) → U16(isNat(activate(V2)))
U16(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V2) → U32(isNatKind(activate(V2)))
U32(tt) → tt
U41(tt) → tt
U51(tt, N) → U52(isNatKind(activate(N)), activate(N))
U52(tt, N) → activate(N)
U61(tt, M, N) → U62(isNatKind(activate(M)), activate(M), activate(N))
U62(tt, M, N) → U63(isNat(activate(N)), activate(M), activate(N))
U63(tt, M, N) → U64(isNatKind(activate(N)), activate(M), activate(N))
U64(tt, M, N) → s(plus(activate(N), activate(M)))
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNatKind(activate(V1)), activate(V1), activate(V2))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatKind(n__0) → tt
isNatKind(n__plus(V1, V2)) → U31(isNatKind(activate(V1)), activate(V2))
isNatKind(n__s(V1)) → U41(isNatKind(activate(V1)))
plus(N, 0') → U51(isNat(N), N)
plus(N, s(M)) → U61(isNat(M), M, N)
0' → n__0
plus(X1, X2) → n__plus(X1, X2)
s(X) → n__s(X)
activate(n__0) → 0'
activate(n__plus(X1, X2)) → plus(X1, X2)
activate(n__s(X)) → s(X)
activate(X) → X

Types:
U11 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
tt :: tt
U12 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
isNatKind :: n__0:n__plus:n__s → tt
activate :: n__0:n__plus:n__s → n__0:n__plus:n__s
U13 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
U14 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
U15 :: tt → n__0:n__plus:n__s → tt
isNat :: n__0:n__plus:n__s → tt
U16 :: tt → tt
U21 :: tt → n__0:n__plus:n__s → tt
U22 :: tt → n__0:n__plus:n__s → tt
U23 :: tt → tt
U31 :: tt → n__0:n__plus:n__s → tt
U32 :: tt → tt
U41 :: tt → tt
U51 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s
U52 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s
U61 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
U62 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
U63 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
U64 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
s :: n__0:n__plus:n__s → n__0:n__plus:n__s
plus :: n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
n__0 :: n__0:n__plus:n__s
n__plus :: n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
n__s :: n__0:n__plus:n__s → n__0:n__plus:n__s
0' :: n__0:n__plus:n__s
hole_tt1_7 :: tt
hole_n__0:n__plus:n__s2_7 :: n__0:n__plus:n__s
gen_n__0:n__plus:n__s3_7 :: Nat → n__0:n__plus:n__s

(5) OrderProof (LOWER BOUND(ID) transformation)

Heuristically decided to analyse the following defined symbols:
isNatKind, activate, isNat, U51, U52, plus

They will be analysed ascendingly in the following order:
isNatKind = activate
isNatKind = isNat
isNatKind = U51
isNatKind = U52
isNatKind = plus
activate = isNat
activate = U51
activate = U52
activate = plus
isNat = U51
isNat = U52
isNat = plus
U51 = U52
U51 = plus
U52 = plus

(6) Obligation:

TRS:
Rules:
U11(tt, V1, V2) → U12(isNatKind(activate(V1)), activate(V1), activate(V2))
U12(tt, V1, V2) → U13(isNatKind(activate(V2)), activate(V1), activate(V2))
U13(tt, V1, V2) → U14(isNatKind(activate(V2)), activate(V1), activate(V2))
U14(tt, V1, V2) → U15(isNat(activate(V1)), activate(V2))
U15(tt, V2) → U16(isNat(activate(V2)))
U16(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V2) → U32(isNatKind(activate(V2)))
U32(tt) → tt
U41(tt) → tt
U51(tt, N) → U52(isNatKind(activate(N)), activate(N))
U52(tt, N) → activate(N)
U61(tt, M, N) → U62(isNatKind(activate(M)), activate(M), activate(N))
U62(tt, M, N) → U63(isNat(activate(N)), activate(M), activate(N))
U63(tt, M, N) → U64(isNatKind(activate(N)), activate(M), activate(N))
U64(tt, M, N) → s(plus(activate(N), activate(M)))
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNatKind(activate(V1)), activate(V1), activate(V2))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatKind(n__0) → tt
isNatKind(n__plus(V1, V2)) → U31(isNatKind(activate(V1)), activate(V2))
isNatKind(n__s(V1)) → U41(isNatKind(activate(V1)))
plus(N, 0') → U51(isNat(N), N)
plus(N, s(M)) → U61(isNat(M), M, N)
0' → n__0
plus(X1, X2) → n__plus(X1, X2)
s(X) → n__s(X)
activate(n__0) → 0'
activate(n__plus(X1, X2)) → plus(X1, X2)
activate(n__s(X)) → s(X)
activate(X) → X

Types:
U11 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
tt :: tt
U12 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
isNatKind :: n__0:n__plus:n__s → tt
activate :: n__0:n__plus:n__s → n__0:n__plus:n__s
U13 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
U14 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
U15 :: tt → n__0:n__plus:n__s → tt
isNat :: n__0:n__plus:n__s → tt
U16 :: tt → tt
U21 :: tt → n__0:n__plus:n__s → tt
U22 :: tt → n__0:n__plus:n__s → tt
U23 :: tt → tt
U31 :: tt → n__0:n__plus:n__s → tt
U32 :: tt → tt
U41 :: tt → tt
U51 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s
U52 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s
U61 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
U62 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
U63 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
U64 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
s :: n__0:n__plus:n__s → n__0:n__plus:n__s
plus :: n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
n__0 :: n__0:n__plus:n__s
n__plus :: n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
n__s :: n__0:n__plus:n__s → n__0:n__plus:n__s
0' :: n__0:n__plus:n__s
hole_tt1_7 :: tt
hole_n__0:n__plus:n__s2_7 :: n__0:n__plus:n__s
gen_n__0:n__plus:n__s3_7 :: Nat → n__0:n__plus:n__s

Generator Equations:
gen_n__0:n__plus:n__s3_7(0) ⇔ n__0
gen_n__0:n__plus:n__s3_7(+(x, 1)) ⇔ n__plus(gen_n__0:n__plus:n__s3_7(x), n__0)

The following defined symbols remain to be analysed:
activate, isNatKind, isNat, U51, U52, plus

They will be analysed ascendingly in the following order:
isNatKind = activate
isNatKind = isNat
isNatKind = U51
isNatKind = U52
isNatKind = plus
activate = isNat
activate = U51
activate = U52
activate = plus
isNat = U51
isNat = U52
isNat = plus
U51 = U52
U51 = plus
U52 = plus

(7) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol activate.

(8) Obligation:

TRS:
Rules:
U11(tt, V1, V2) → U12(isNatKind(activate(V1)), activate(V1), activate(V2))
U12(tt, V1, V2) → U13(isNatKind(activate(V2)), activate(V1), activate(V2))
U13(tt, V1, V2) → U14(isNatKind(activate(V2)), activate(V1), activate(V2))
U14(tt, V1, V2) → U15(isNat(activate(V1)), activate(V2))
U15(tt, V2) → U16(isNat(activate(V2)))
U16(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V2) → U32(isNatKind(activate(V2)))
U32(tt) → tt
U41(tt) → tt
U51(tt, N) → U52(isNatKind(activate(N)), activate(N))
U52(tt, N) → activate(N)
U61(tt, M, N) → U62(isNatKind(activate(M)), activate(M), activate(N))
U62(tt, M, N) → U63(isNat(activate(N)), activate(M), activate(N))
U63(tt, M, N) → U64(isNatKind(activate(N)), activate(M), activate(N))
U64(tt, M, N) → s(plus(activate(N), activate(M)))
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNatKind(activate(V1)), activate(V1), activate(V2))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatKind(n__0) → tt
isNatKind(n__plus(V1, V2)) → U31(isNatKind(activate(V1)), activate(V2))
isNatKind(n__s(V1)) → U41(isNatKind(activate(V1)))
plus(N, 0') → U51(isNat(N), N)
plus(N, s(M)) → U61(isNat(M), M, N)
0' → n__0
plus(X1, X2) → n__plus(X1, X2)
s(X) → n__s(X)
activate(n__0) → 0'
activate(n__plus(X1, X2)) → plus(X1, X2)
activate(n__s(X)) → s(X)
activate(X) → X

Types:
U11 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
tt :: tt
U12 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
isNatKind :: n__0:n__plus:n__s → tt
activate :: n__0:n__plus:n__s → n__0:n__plus:n__s
U13 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
U14 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
U15 :: tt → n__0:n__plus:n__s → tt
isNat :: n__0:n__plus:n__s → tt
U16 :: tt → tt
U21 :: tt → n__0:n__plus:n__s → tt
U22 :: tt → n__0:n__plus:n__s → tt
U23 :: tt → tt
U31 :: tt → n__0:n__plus:n__s → tt
U32 :: tt → tt
U41 :: tt → tt
U51 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s
U52 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s
U61 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
U62 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
U63 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
U64 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
s :: n__0:n__plus:n__s → n__0:n__plus:n__s
plus :: n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
n__0 :: n__0:n__plus:n__s
n__plus :: n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
n__s :: n__0:n__plus:n__s → n__0:n__plus:n__s
0' :: n__0:n__plus:n__s
hole_tt1_7 :: tt
hole_n__0:n__plus:n__s2_7 :: n__0:n__plus:n__s
gen_n__0:n__plus:n__s3_7 :: Nat → n__0:n__plus:n__s

Generator Equations:
gen_n__0:n__plus:n__s3_7(0) ⇔ n__0
gen_n__0:n__plus:n__s3_7(+(x, 1)) ⇔ n__plus(gen_n__0:n__plus:n__s3_7(x), n__0)

The following defined symbols remain to be analysed:
plus, isNatKind, isNat, U51, U52

They will be analysed ascendingly in the following order:
isNatKind = activate
isNatKind = isNat
isNatKind = U51
isNatKind = U52
isNatKind = plus
activate = isNat
activate = U51
activate = U52
activate = plus
isNat = U51
isNat = U52
isNat = plus
U51 = U52
U51 = plus
U52 = plus

(9) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol plus.

(10) Obligation:

TRS:
Rules:
U11(tt, V1, V2) → U12(isNatKind(activate(V1)), activate(V1), activate(V2))
U12(tt, V1, V2) → U13(isNatKind(activate(V2)), activate(V1), activate(V2))
U13(tt, V1, V2) → U14(isNatKind(activate(V2)), activate(V1), activate(V2))
U14(tt, V1, V2) → U15(isNat(activate(V1)), activate(V2))
U15(tt, V2) → U16(isNat(activate(V2)))
U16(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V2) → U32(isNatKind(activate(V2)))
U32(tt) → tt
U41(tt) → tt
U51(tt, N) → U52(isNatKind(activate(N)), activate(N))
U52(tt, N) → activate(N)
U61(tt, M, N) → U62(isNatKind(activate(M)), activate(M), activate(N))
U62(tt, M, N) → U63(isNat(activate(N)), activate(M), activate(N))
U63(tt, M, N) → U64(isNatKind(activate(N)), activate(M), activate(N))
U64(tt, M, N) → s(plus(activate(N), activate(M)))
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNatKind(activate(V1)), activate(V1), activate(V2))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatKind(n__0) → tt
isNatKind(n__plus(V1, V2)) → U31(isNatKind(activate(V1)), activate(V2))
isNatKind(n__s(V1)) → U41(isNatKind(activate(V1)))
plus(N, 0') → U51(isNat(N), N)
plus(N, s(M)) → U61(isNat(M), M, N)
0' → n__0
plus(X1, X2) → n__plus(X1, X2)
s(X) → n__s(X)
activate(n__0) → 0'
activate(n__plus(X1, X2)) → plus(X1, X2)
activate(n__s(X)) → s(X)
activate(X) → X

Types:
U11 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
tt :: tt
U12 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
isNatKind :: n__0:n__plus:n__s → tt
activate :: n__0:n__plus:n__s → n__0:n__plus:n__s
U13 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
U14 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
U15 :: tt → n__0:n__plus:n__s → tt
isNat :: n__0:n__plus:n__s → tt
U16 :: tt → tt
U21 :: tt → n__0:n__plus:n__s → tt
U22 :: tt → n__0:n__plus:n__s → tt
U23 :: tt → tt
U31 :: tt → n__0:n__plus:n__s → tt
U32 :: tt → tt
U41 :: tt → tt
U51 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s
U52 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s
U61 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
U62 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
U63 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
U64 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
s :: n__0:n__plus:n__s → n__0:n__plus:n__s
plus :: n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
n__0 :: n__0:n__plus:n__s
n__plus :: n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
n__s :: n__0:n__plus:n__s → n__0:n__plus:n__s
0' :: n__0:n__plus:n__s
hole_tt1_7 :: tt
hole_n__0:n__plus:n__s2_7 :: n__0:n__plus:n__s
gen_n__0:n__plus:n__s3_7 :: Nat → n__0:n__plus:n__s

Generator Equations:
gen_n__0:n__plus:n__s3_7(0) ⇔ n__0
gen_n__0:n__plus:n__s3_7(+(x, 1)) ⇔ n__plus(gen_n__0:n__plus:n__s3_7(x), n__0)

The following defined symbols remain to be analysed:
U51, isNatKind, isNat, U52

They will be analysed ascendingly in the following order:
isNatKind = activate
isNatKind = isNat
isNatKind = U51
isNatKind = U52
isNatKind = plus
activate = isNat
activate = U51
activate = U52
activate = plus
isNat = U51
isNat = U52
isNat = plus
U51 = U52
U51 = plus
U52 = plus

(11) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol U51.

(12) Obligation:

TRS:
Rules:
U11(tt, V1, V2) → U12(isNatKind(activate(V1)), activate(V1), activate(V2))
U12(tt, V1, V2) → U13(isNatKind(activate(V2)), activate(V1), activate(V2))
U13(tt, V1, V2) → U14(isNatKind(activate(V2)), activate(V1), activate(V2))
U14(tt, V1, V2) → U15(isNat(activate(V1)), activate(V2))
U15(tt, V2) → U16(isNat(activate(V2)))
U16(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V2) → U32(isNatKind(activate(V2)))
U32(tt) → tt
U41(tt) → tt
U51(tt, N) → U52(isNatKind(activate(N)), activate(N))
U52(tt, N) → activate(N)
U61(tt, M, N) → U62(isNatKind(activate(M)), activate(M), activate(N))
U62(tt, M, N) → U63(isNat(activate(N)), activate(M), activate(N))
U63(tt, M, N) → U64(isNatKind(activate(N)), activate(M), activate(N))
U64(tt, M, N) → s(plus(activate(N), activate(M)))
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNatKind(activate(V1)), activate(V1), activate(V2))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatKind(n__0) → tt
isNatKind(n__plus(V1, V2)) → U31(isNatKind(activate(V1)), activate(V2))
isNatKind(n__s(V1)) → U41(isNatKind(activate(V1)))
plus(N, 0') → U51(isNat(N), N)
plus(N, s(M)) → U61(isNat(M), M, N)
0' → n__0
plus(X1, X2) → n__plus(X1, X2)
s(X) → n__s(X)
activate(n__0) → 0'
activate(n__plus(X1, X2)) → plus(X1, X2)
activate(n__s(X)) → s(X)
activate(X) → X

Types:
U11 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
tt :: tt
U12 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
isNatKind :: n__0:n__plus:n__s → tt
activate :: n__0:n__plus:n__s → n__0:n__plus:n__s
U13 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
U14 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
U15 :: tt → n__0:n__plus:n__s → tt
isNat :: n__0:n__plus:n__s → tt
U16 :: tt → tt
U21 :: tt → n__0:n__plus:n__s → tt
U22 :: tt → n__0:n__plus:n__s → tt
U23 :: tt → tt
U31 :: tt → n__0:n__plus:n__s → tt
U32 :: tt → tt
U41 :: tt → tt
U51 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s
U52 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s
U61 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
U62 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
U63 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
U64 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
s :: n__0:n__plus:n__s → n__0:n__plus:n__s
plus :: n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
n__0 :: n__0:n__plus:n__s
n__plus :: n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
n__s :: n__0:n__plus:n__s → n__0:n__plus:n__s
0' :: n__0:n__plus:n__s
hole_tt1_7 :: tt
hole_n__0:n__plus:n__s2_7 :: n__0:n__plus:n__s
gen_n__0:n__plus:n__s3_7 :: Nat → n__0:n__plus:n__s

Generator Equations:
gen_n__0:n__plus:n__s3_7(0) ⇔ n__0
gen_n__0:n__plus:n__s3_7(+(x, 1)) ⇔ n__plus(gen_n__0:n__plus:n__s3_7(x), n__0)

The following defined symbols remain to be analysed:
U52, isNatKind, isNat

They will be analysed ascendingly in the following order:
isNatKind = activate
isNatKind = isNat
isNatKind = U51
isNatKind = U52
isNatKind = plus
activate = isNat
activate = U51
activate = U52
activate = plus
isNat = U51
isNat = U52
isNat = plus
U51 = U52
U51 = plus
U52 = plus

(13) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol U52.

(14) Obligation:

TRS:
Rules:
U11(tt, V1, V2) → U12(isNatKind(activate(V1)), activate(V1), activate(V2))
U12(tt, V1, V2) → U13(isNatKind(activate(V2)), activate(V1), activate(V2))
U13(tt, V1, V2) → U14(isNatKind(activate(V2)), activate(V1), activate(V2))
U14(tt, V1, V2) → U15(isNat(activate(V1)), activate(V2))
U15(tt, V2) → U16(isNat(activate(V2)))
U16(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V2) → U32(isNatKind(activate(V2)))
U32(tt) → tt
U41(tt) → tt
U51(tt, N) → U52(isNatKind(activate(N)), activate(N))
U52(tt, N) → activate(N)
U61(tt, M, N) → U62(isNatKind(activate(M)), activate(M), activate(N))
U62(tt, M, N) → U63(isNat(activate(N)), activate(M), activate(N))
U63(tt, M, N) → U64(isNatKind(activate(N)), activate(M), activate(N))
U64(tt, M, N) → s(plus(activate(N), activate(M)))
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNatKind(activate(V1)), activate(V1), activate(V2))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatKind(n__0) → tt
isNatKind(n__plus(V1, V2)) → U31(isNatKind(activate(V1)), activate(V2))
isNatKind(n__s(V1)) → U41(isNatKind(activate(V1)))
plus(N, 0') → U51(isNat(N), N)
plus(N, s(M)) → U61(isNat(M), M, N)
0' → n__0
plus(X1, X2) → n__plus(X1, X2)
s(X) → n__s(X)
activate(n__0) → 0'
activate(n__plus(X1, X2)) → plus(X1, X2)
activate(n__s(X)) → s(X)
activate(X) → X

Types:
U11 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
tt :: tt
U12 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
isNatKind :: n__0:n__plus:n__s → tt
activate :: n__0:n__plus:n__s → n__0:n__plus:n__s
U13 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
U14 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
U15 :: tt → n__0:n__plus:n__s → tt
isNat :: n__0:n__plus:n__s → tt
U16 :: tt → tt
U21 :: tt → n__0:n__plus:n__s → tt
U22 :: tt → n__0:n__plus:n__s → tt
U23 :: tt → tt
U31 :: tt → n__0:n__plus:n__s → tt
U32 :: tt → tt
U41 :: tt → tt
U51 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s
U52 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s
U61 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
U62 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
U63 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
U64 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
s :: n__0:n__plus:n__s → n__0:n__plus:n__s
plus :: n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
n__0 :: n__0:n__plus:n__s
n__plus :: n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
n__s :: n__0:n__plus:n__s → n__0:n__plus:n__s
0' :: n__0:n__plus:n__s
hole_tt1_7 :: tt
hole_n__0:n__plus:n__s2_7 :: n__0:n__plus:n__s
gen_n__0:n__plus:n__s3_7 :: Nat → n__0:n__plus:n__s

Generator Equations:
gen_n__0:n__plus:n__s3_7(0) ⇔ n__0
gen_n__0:n__plus:n__s3_7(+(x, 1)) ⇔ n__plus(gen_n__0:n__plus:n__s3_7(x), n__0)

The following defined symbols remain to be analysed:
isNatKind, isNat

They will be analysed ascendingly in the following order:
isNatKind = activate
isNatKind = isNat
isNatKind = U51
isNatKind = U52
isNatKind = plus
activate = isNat
activate = U51
activate = U52
activate = plus
isNat = U51
isNat = U52
isNat = plus
U51 = U52
U51 = plus
U52 = plus

(15) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
isNatKind(gen_n__0:n__plus:n__s3_7(n3066_7)) → tt, rt ∈ Ω(1 + n3066₇)

Induction Base:
isNatKind(gen_n__0:n__plus:n__s3_7(0)) →_R^Ω(1)
tt

Induction Step:
isNatKind(gen_n__0:n__plus:n__s3_7(+(n3066_7, 1))) →_R^Ω(1)
U31(isNatKind(activate(gen_n__0:n__plus:n__s3_7(n3066_7))), activate(n__0)) →_R^Ω(1)
U31(isNatKind(gen_n__0:n__plus:n__s3_7(n3066_7)), activate(n__0)) →_IH
U31(tt, activate(n__0)) →_R^Ω(1)
U31(tt, n__0) →_R^Ω(1)
U32(isNatKind(activate(n__0))) →_R^Ω(1)
U32(isNatKind(n__0)) →_R^Ω(1)
U32(tt) →_R^Ω(1)
tt

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(16) Complex Obligation (BEST)

(17) Obligation:

TRS:
Rules:
U11(tt, V1, V2) → U12(isNatKind(activate(V1)), activate(V1), activate(V2))
U12(tt, V1, V2) → U13(isNatKind(activate(V2)), activate(V1), activate(V2))
U13(tt, V1, V2) → U14(isNatKind(activate(V2)), activate(V1), activate(V2))
U14(tt, V1, V2) → U15(isNat(activate(V1)), activate(V2))
U15(tt, V2) → U16(isNat(activate(V2)))
U16(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V2) → U32(isNatKind(activate(V2)))
U32(tt) → tt
U41(tt) → tt
U51(tt, N) → U52(isNatKind(activate(N)), activate(N))
U52(tt, N) → activate(N)
U61(tt, M, N) → U62(isNatKind(activate(M)), activate(M), activate(N))
U62(tt, M, N) → U63(isNat(activate(N)), activate(M), activate(N))
U63(tt, M, N) → U64(isNatKind(activate(N)), activate(M), activate(N))
U64(tt, M, N) → s(plus(activate(N), activate(M)))
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNatKind(activate(V1)), activate(V1), activate(V2))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatKind(n__0) → tt
isNatKind(n__plus(V1, V2)) → U31(isNatKind(activate(V1)), activate(V2))
isNatKind(n__s(V1)) → U41(isNatKind(activate(V1)))
plus(N, 0') → U51(isNat(N), N)
plus(N, s(M)) → U61(isNat(M), M, N)
0' → n__0
plus(X1, X2) → n__plus(X1, X2)
s(X) → n__s(X)
activate(n__0) → 0'
activate(n__plus(X1, X2)) → plus(X1, X2)
activate(n__s(X)) → s(X)
activate(X) → X

Types:
U11 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
tt :: tt
U12 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
isNatKind :: n__0:n__plus:n__s → tt
activate :: n__0:n__plus:n__s → n__0:n__plus:n__s
U13 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
U14 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
U15 :: tt → n__0:n__plus:n__s → tt
isNat :: n__0:n__plus:n__s → tt
U16 :: tt → tt
U21 :: tt → n__0:n__plus:n__s → tt
U22 :: tt → n__0:n__plus:n__s → tt
U23 :: tt → tt
U31 :: tt → n__0:n__plus:n__s → tt
U32 :: tt → tt
U41 :: tt → tt
U51 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s
U52 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s
U61 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
U62 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
U63 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
U64 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
s :: n__0:n__plus:n__s → n__0:n__plus:n__s
plus :: n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
n__0 :: n__0:n__plus:n__s
n__plus :: n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
n__s :: n__0:n__plus:n__s → n__0:n__plus:n__s
0' :: n__0:n__plus:n__s
hole_tt1_7 :: tt
hole_n__0:n__plus:n__s2_7 :: n__0:n__plus:n__s
gen_n__0:n__plus:n__s3_7 :: Nat → n__0:n__plus:n__s

Lemmas:
isNatKind(gen_n__0:n__plus:n__s3_7(n3066_7)) → tt, rt ∈ Ω(1 + n3066₇)

Generator Equations:
gen_n__0:n__plus:n__s3_7(0) ⇔ n__0
gen_n__0:n__plus:n__s3_7(+(x, 1)) ⇔ n__plus(gen_n__0:n__plus:n__s3_7(x), n__0)

The following defined symbols remain to be analysed:
isNat, activate, U51, U52, plus

They will be analysed ascendingly in the following order:
isNatKind = activate
isNatKind = isNat
isNatKind = U51
isNatKind = U52
isNatKind = plus
activate = isNat
activate = U51
activate = U52
activate = plus
isNat = U51
isNat = U52
isNat = plus
U51 = U52
U51 = plus
U52 = plus

(18) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol isNat.

(19) Obligation:

TRS:
Rules:
U11(tt, V1, V2) → U12(isNatKind(activate(V1)), activate(V1), activate(V2))
U12(tt, V1, V2) → U13(isNatKind(activate(V2)), activate(V1), activate(V2))
U13(tt, V1, V2) → U14(isNatKind(activate(V2)), activate(V1), activate(V2))
U14(tt, V1, V2) → U15(isNat(activate(V1)), activate(V2))
U15(tt, V2) → U16(isNat(activate(V2)))
U16(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V2) → U32(isNatKind(activate(V2)))
U32(tt) → tt
U41(tt) → tt
U51(tt, N) → U52(isNatKind(activate(N)), activate(N))
U52(tt, N) → activate(N)
U61(tt, M, N) → U62(isNatKind(activate(M)), activate(M), activate(N))
U62(tt, M, N) → U63(isNat(activate(N)), activate(M), activate(N))
U63(tt, M, N) → U64(isNatKind(activate(N)), activate(M), activate(N))
U64(tt, M, N) → s(plus(activate(N), activate(M)))
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNatKind(activate(V1)), activate(V1), activate(V2))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatKind(n__0) → tt
isNatKind(n__plus(V1, V2)) → U31(isNatKind(activate(V1)), activate(V2))
isNatKind(n__s(V1)) → U41(isNatKind(activate(V1)))
plus(N, 0') → U51(isNat(N), N)
plus(N, s(M)) → U61(isNat(M), M, N)
0' → n__0
plus(X1, X2) → n__plus(X1, X2)
s(X) → n__s(X)
activate(n__0) → 0'
activate(n__plus(X1, X2)) → plus(X1, X2)
activate(n__s(X)) → s(X)
activate(X) → X

Types:
U11 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
tt :: tt
U12 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
isNatKind :: n__0:n__plus:n__s → tt
activate :: n__0:n__plus:n__s → n__0:n__plus:n__s
U13 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
U14 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
U15 :: tt → n__0:n__plus:n__s → tt
isNat :: n__0:n__plus:n__s → tt
U16 :: tt → tt
U21 :: tt → n__0:n__plus:n__s → tt
U22 :: tt → n__0:n__plus:n__s → tt
U23 :: tt → tt
U31 :: tt → n__0:n__plus:n__s → tt
U32 :: tt → tt
U41 :: tt → tt
U51 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s
U52 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s
U61 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
U62 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
U63 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
U64 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
s :: n__0:n__plus:n__s → n__0:n__plus:n__s
plus :: n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
n__0 :: n__0:n__plus:n__s
n__plus :: n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
n__s :: n__0:n__plus:n__s → n__0:n__plus:n__s
0' :: n__0:n__plus:n__s
hole_tt1_7 :: tt
hole_n__0:n__plus:n__s2_7 :: n__0:n__plus:n__s
gen_n__0:n__plus:n__s3_7 :: Nat → n__0:n__plus:n__s

Lemmas:
isNatKind(gen_n__0:n__plus:n__s3_7(n3066_7)) → tt, rt ∈ Ω(1 + n3066₇)

Generator Equations:
gen_n__0:n__plus:n__s3_7(0) ⇔ n__0
gen_n__0:n__plus:n__s3_7(+(x, 1)) ⇔ n__plus(gen_n__0:n__plus:n__s3_7(x), n__0)

The following defined symbols remain to be analysed:
activate, U51, U52, plus

They will be analysed ascendingly in the following order:
isNatKind = activate
isNatKind = isNat
isNatKind = U51
isNatKind = U52
isNatKind = plus
activate = isNat
activate = U51
activate = U52
activate = plus
isNat = U51
isNat = U52
isNat = plus
U51 = U52
U51 = plus
U52 = plus

(20) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol activate.

(21) Obligation:

TRS:
Rules:
U11(tt, V1, V2) → U12(isNatKind(activate(V1)), activate(V1), activate(V2))
U12(tt, V1, V2) → U13(isNatKind(activate(V2)), activate(V1), activate(V2))
U13(tt, V1, V2) → U14(isNatKind(activate(V2)), activate(V1), activate(V2))
U14(tt, V1, V2) → U15(isNat(activate(V1)), activate(V2))
U15(tt, V2) → U16(isNat(activate(V2)))
U16(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V2) → U32(isNatKind(activate(V2)))
U32(tt) → tt
U41(tt) → tt
U51(tt, N) → U52(isNatKind(activate(N)), activate(N))
U52(tt, N) → activate(N)
U61(tt, M, N) → U62(isNatKind(activate(M)), activate(M), activate(N))
U62(tt, M, N) → U63(isNat(activate(N)), activate(M), activate(N))
U63(tt, M, N) → U64(isNatKind(activate(N)), activate(M), activate(N))
U64(tt, M, N) → s(plus(activate(N), activate(M)))
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNatKind(activate(V1)), activate(V1), activate(V2))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatKind(n__0) → tt
isNatKind(n__plus(V1, V2)) → U31(isNatKind(activate(V1)), activate(V2))
isNatKind(n__s(V1)) → U41(isNatKind(activate(V1)))
plus(N, 0') → U51(isNat(N), N)
plus(N, s(M)) → U61(isNat(M), M, N)
0' → n__0
plus(X1, X2) → n__plus(X1, X2)
s(X) → n__s(X)
activate(n__0) → 0'
activate(n__plus(X1, X2)) → plus(X1, X2)
activate(n__s(X)) → s(X)
activate(X) → X

Types:
U11 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
tt :: tt
U12 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
isNatKind :: n__0:n__plus:n__s → tt
activate :: n__0:n__plus:n__s → n__0:n__plus:n__s
U13 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
U14 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
U15 :: tt → n__0:n__plus:n__s → tt
isNat :: n__0:n__plus:n__s → tt
U16 :: tt → tt
U21 :: tt → n__0:n__plus:n__s → tt
U22 :: tt → n__0:n__plus:n__s → tt
U23 :: tt → tt
U31 :: tt → n__0:n__plus:n__s → tt
U32 :: tt → tt
U41 :: tt → tt
U51 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s
U52 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s
U61 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
U62 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
U63 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
U64 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
s :: n__0:n__plus:n__s → n__0:n__plus:n__s
plus :: n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
n__0 :: n__0:n__plus:n__s
n__plus :: n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
n__s :: n__0:n__plus:n__s → n__0:n__plus:n__s
0' :: n__0:n__plus:n__s
hole_tt1_7 :: tt
hole_n__0:n__plus:n__s2_7 :: n__0:n__plus:n__s
gen_n__0:n__plus:n__s3_7 :: Nat → n__0:n__plus:n__s

Lemmas:
isNatKind(gen_n__0:n__plus:n__s3_7(n3066_7)) → tt, rt ∈ Ω(1 + n3066₇)

Generator Equations:
gen_n__0:n__plus:n__s3_7(0) ⇔ n__0
gen_n__0:n__plus:n__s3_7(+(x, 1)) ⇔ n__plus(gen_n__0:n__plus:n__s3_7(x), n__0)

The following defined symbols remain to be analysed:
plus, U51, U52

They will be analysed ascendingly in the following order:
isNatKind = activate
isNatKind = isNat
isNatKind = U51
isNatKind = U52
isNatKind = plus
activate = isNat
activate = U51
activate = U52
activate = plus
isNat = U51
isNat = U52
isNat = plus
U51 = U52
U51 = plus
U52 = plus

(22) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol plus.

(23) Obligation:

TRS:
Rules:
U11(tt, V1, V2) → U12(isNatKind(activate(V1)), activate(V1), activate(V2))
U12(tt, V1, V2) → U13(isNatKind(activate(V2)), activate(V1), activate(V2))
U13(tt, V1, V2) → U14(isNatKind(activate(V2)), activate(V1), activate(V2))
U14(tt, V1, V2) → U15(isNat(activate(V1)), activate(V2))
U15(tt, V2) → U16(isNat(activate(V2)))
U16(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V2) → U32(isNatKind(activate(V2)))
U32(tt) → tt
U41(tt) → tt
U51(tt, N) → U52(isNatKind(activate(N)), activate(N))
U52(tt, N) → activate(N)
U61(tt, M, N) → U62(isNatKind(activate(M)), activate(M), activate(N))
U62(tt, M, N) → U63(isNat(activate(N)), activate(M), activate(N))
U63(tt, M, N) → U64(isNatKind(activate(N)), activate(M), activate(N))
U64(tt, M, N) → s(plus(activate(N), activate(M)))
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNatKind(activate(V1)), activate(V1), activate(V2))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatKind(n__0) → tt
isNatKind(n__plus(V1, V2)) → U31(isNatKind(activate(V1)), activate(V2))
isNatKind(n__s(V1)) → U41(isNatKind(activate(V1)))
plus(N, 0') → U51(isNat(N), N)
plus(N, s(M)) → U61(isNat(M), M, N)
0' → n__0
plus(X1, X2) → n__plus(X1, X2)
s(X) → n__s(X)
activate(n__0) → 0'
activate(n__plus(X1, X2)) → plus(X1, X2)
activate(n__s(X)) → s(X)
activate(X) → X

Types:
U11 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
tt :: tt
U12 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
isNatKind :: n__0:n__plus:n__s → tt
activate :: n__0:n__plus:n__s → n__0:n__plus:n__s
U13 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
U14 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
U15 :: tt → n__0:n__plus:n__s → tt
isNat :: n__0:n__plus:n__s → tt
U16 :: tt → tt
U21 :: tt → n__0:n__plus:n__s → tt
U22 :: tt → n__0:n__plus:n__s → tt
U23 :: tt → tt
U31 :: tt → n__0:n__plus:n__s → tt
U32 :: tt → tt
U41 :: tt → tt
U51 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s
U52 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s
U61 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
U62 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
U63 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
U64 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
s :: n__0:n__plus:n__s → n__0:n__plus:n__s
plus :: n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
n__0 :: n__0:n__plus:n__s
n__plus :: n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
n__s :: n__0:n__plus:n__s → n__0:n__plus:n__s
0' :: n__0:n__plus:n__s
hole_tt1_7 :: tt
hole_n__0:n__plus:n__s2_7 :: n__0:n__plus:n__s
gen_n__0:n__plus:n__s3_7 :: Nat → n__0:n__plus:n__s

Lemmas:
isNatKind(gen_n__0:n__plus:n__s3_7(n3066_7)) → tt, rt ∈ Ω(1 + n3066₇)

Generator Equations:
gen_n__0:n__plus:n__s3_7(0) ⇔ n__0
gen_n__0:n__plus:n__s3_7(+(x, 1)) ⇔ n__plus(gen_n__0:n__plus:n__s3_7(x), n__0)

The following defined symbols remain to be analysed:
U51, U52

They will be analysed ascendingly in the following order:
isNatKind = activate
isNatKind = isNat
isNatKind = U51
isNatKind = U52
isNatKind = plus
activate = isNat
activate = U51
activate = U52
activate = plus
isNat = U51
isNat = U52
isNat = plus
U51 = U52
U51 = plus
U52 = plus

(24) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol U51.

(25) Obligation:

TRS:
Rules:
U11(tt, V1, V2) → U12(isNatKind(activate(V1)), activate(V1), activate(V2))
U12(tt, V1, V2) → U13(isNatKind(activate(V2)), activate(V1), activate(V2))
U13(tt, V1, V2) → U14(isNatKind(activate(V2)), activate(V1), activate(V2))
U14(tt, V1, V2) → U15(isNat(activate(V1)), activate(V2))
U15(tt, V2) → U16(isNat(activate(V2)))
U16(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V2) → U32(isNatKind(activate(V2)))
U32(tt) → tt
U41(tt) → tt
U51(tt, N) → U52(isNatKind(activate(N)), activate(N))
U52(tt, N) → activate(N)
U61(tt, M, N) → U62(isNatKind(activate(M)), activate(M), activate(N))
U62(tt, M, N) → U63(isNat(activate(N)), activate(M), activate(N))
U63(tt, M, N) → U64(isNatKind(activate(N)), activate(M), activate(N))
U64(tt, M, N) → s(plus(activate(N), activate(M)))
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNatKind(activate(V1)), activate(V1), activate(V2))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatKind(n__0) → tt
isNatKind(n__plus(V1, V2)) → U31(isNatKind(activate(V1)), activate(V2))
isNatKind(n__s(V1)) → U41(isNatKind(activate(V1)))
plus(N, 0') → U51(isNat(N), N)
plus(N, s(M)) → U61(isNat(M), M, N)
0' → n__0
plus(X1, X2) → n__plus(X1, X2)
s(X) → n__s(X)
activate(n__0) → 0'
activate(n__plus(X1, X2)) → plus(X1, X2)
activate(n__s(X)) → s(X)
activate(X) → X

Types:
U11 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
tt :: tt
U12 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
isNatKind :: n__0:n__plus:n__s → tt
activate :: n__0:n__plus:n__s → n__0:n__plus:n__s
U13 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
U14 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
U15 :: tt → n__0:n__plus:n__s → tt
isNat :: n__0:n__plus:n__s → tt
U16 :: tt → tt
U21 :: tt → n__0:n__plus:n__s → tt
U22 :: tt → n__0:n__plus:n__s → tt
U23 :: tt → tt
U31 :: tt → n__0:n__plus:n__s → tt
U32 :: tt → tt
U41 :: tt → tt
U51 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s
U52 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s
U61 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
U62 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
U63 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
U64 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
s :: n__0:n__plus:n__s → n__0:n__plus:n__s
plus :: n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
n__0 :: n__0:n__plus:n__s
n__plus :: n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
n__s :: n__0:n__plus:n__s → n__0:n__plus:n__s
0' :: n__0:n__plus:n__s
hole_tt1_7 :: tt
hole_n__0:n__plus:n__s2_7 :: n__0:n__plus:n__s
gen_n__0:n__plus:n__s3_7 :: Nat → n__0:n__plus:n__s

Lemmas:
isNatKind(gen_n__0:n__plus:n__s3_7(n3066_7)) → tt, rt ∈ Ω(1 + n3066₇)

Generator Equations:
gen_n__0:n__plus:n__s3_7(0) ⇔ n__0
gen_n__0:n__plus:n__s3_7(+(x, 1)) ⇔ n__plus(gen_n__0:n__plus:n__s3_7(x), n__0)

The following defined symbols remain to be analysed:
U52

They will be analysed ascendingly in the following order:
isNatKind = activate
isNatKind = isNat
isNatKind = U51
isNatKind = U52
isNatKind = plus
activate = isNat
activate = U51
activate = U52
activate = plus
isNat = U51
isNat = U52
isNat = plus
U51 = U52
U51 = plus
U52 = plus

(26) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol U52.

(27) Obligation:

TRS:
Rules:
U11(tt, V1, V2) → U12(isNatKind(activate(V1)), activate(V1), activate(V2))
U12(tt, V1, V2) → U13(isNatKind(activate(V2)), activate(V1), activate(V2))
U13(tt, V1, V2) → U14(isNatKind(activate(V2)), activate(V1), activate(V2))
U14(tt, V1, V2) → U15(isNat(activate(V1)), activate(V2))
U15(tt, V2) → U16(isNat(activate(V2)))
U16(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V2) → U32(isNatKind(activate(V2)))
U32(tt) → tt
U41(tt) → tt
U51(tt, N) → U52(isNatKind(activate(N)), activate(N))
U52(tt, N) → activate(N)
U61(tt, M, N) → U62(isNatKind(activate(M)), activate(M), activate(N))
U62(tt, M, N) → U63(isNat(activate(N)), activate(M), activate(N))
U63(tt, M, N) → U64(isNatKind(activate(N)), activate(M), activate(N))
U64(tt, M, N) → s(plus(activate(N), activate(M)))
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNatKind(activate(V1)), activate(V1), activate(V2))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatKind(n__0) → tt
isNatKind(n__plus(V1, V2)) → U31(isNatKind(activate(V1)), activate(V2))
isNatKind(n__s(V1)) → U41(isNatKind(activate(V1)))
plus(N, 0') → U51(isNat(N), N)
plus(N, s(M)) → U61(isNat(M), M, N)
0' → n__0
plus(X1, X2) → n__plus(X1, X2)
s(X) → n__s(X)
activate(n__0) → 0'
activate(n__plus(X1, X2)) → plus(X1, X2)
activate(n__s(X)) → s(X)
activate(X) → X

Types:
U11 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
tt :: tt
U12 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
isNatKind :: n__0:n__plus:n__s → tt
activate :: n__0:n__plus:n__s → n__0:n__plus:n__s
U13 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
U14 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
U15 :: tt → n__0:n__plus:n__s → tt
isNat :: n__0:n__plus:n__s → tt
U16 :: tt → tt
U21 :: tt → n__0:n__plus:n__s → tt
U22 :: tt → n__0:n__plus:n__s → tt
U23 :: tt → tt
U31 :: tt → n__0:n__plus:n__s → tt
U32 :: tt → tt
U41 :: tt → tt
U51 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s
U52 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s
U61 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
U62 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
U63 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
U64 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
s :: n__0:n__plus:n__s → n__0:n__plus:n__s
plus :: n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
n__0 :: n__0:n__plus:n__s
n__plus :: n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
n__s :: n__0:n__plus:n__s → n__0:n__plus:n__s
0' :: n__0:n__plus:n__s
hole_tt1_7 :: tt
hole_n__0:n__plus:n__s2_7 :: n__0:n__plus:n__s
gen_n__0:n__plus:n__s3_7 :: Nat → n__0:n__plus:n__s

Lemmas:
isNatKind(gen_n__0:n__plus:n__s3_7(n3066_7)) → tt, rt ∈ Ω(1 + n3066₇)

Generator Equations:
gen_n__0:n__plus:n__s3_7(0) ⇔ n__0
gen_n__0:n__plus:n__s3_7(+(x, 1)) ⇔ n__plus(gen_n__0:n__plus:n__s3_7(x), n__0)

No more defined symbols left to analyse.

(28) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
isNatKind(gen_n__0:n__plus:n__s3_7(n3066_7)) → tt, rt ∈ Ω(1 + n3066₇)

(29) BOUNDS(n^1, INF)

(30) Obligation:

TRS:
Rules:
U11(tt, V1, V2) → U12(isNatKind(activate(V1)), activate(V1), activate(V2))
U12(tt, V1, V2) → U13(isNatKind(activate(V2)), activate(V1), activate(V2))
U13(tt, V1, V2) → U14(isNatKind(activate(V2)), activate(V1), activate(V2))
U14(tt, V1, V2) → U15(isNat(activate(V1)), activate(V2))
U15(tt, V2) → U16(isNat(activate(V2)))
U16(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V2) → U32(isNatKind(activate(V2)))
U32(tt) → tt
U41(tt) → tt
U51(tt, N) → U52(isNatKind(activate(N)), activate(N))
U52(tt, N) → activate(N)
U61(tt, M, N) → U62(isNatKind(activate(M)), activate(M), activate(N))
U62(tt, M, N) → U63(isNat(activate(N)), activate(M), activate(N))
U63(tt, M, N) → U64(isNatKind(activate(N)), activate(M), activate(N))
U64(tt, M, N) → s(plus(activate(N), activate(M)))
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNatKind(activate(V1)), activate(V1), activate(V2))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatKind(n__0) → tt
isNatKind(n__plus(V1, V2)) → U31(isNatKind(activate(V1)), activate(V2))
isNatKind(n__s(V1)) → U41(isNatKind(activate(V1)))
plus(N, 0') → U51(isNat(N), N)
plus(N, s(M)) → U61(isNat(M), M, N)
0' → n__0
plus(X1, X2) → n__plus(X1, X2)
s(X) → n__s(X)
activate(n__0) → 0'
activate(n__plus(X1, X2)) → plus(X1, X2)
activate(n__s(X)) → s(X)
activate(X) → X

Types:
U11 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
tt :: tt
U12 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
isNatKind :: n__0:n__plus:n__s → tt
activate :: n__0:n__plus:n__s → n__0:n__plus:n__s
U13 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
U14 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → tt
U15 :: tt → n__0:n__plus:n__s → tt
isNat :: n__0:n__plus:n__s → tt
U16 :: tt → tt
U21 :: tt → n__0:n__plus:n__s → tt
U22 :: tt → n__0:n__plus:n__s → tt
U23 :: tt → tt
U31 :: tt → n__0:n__plus:n__s → tt
U32 :: tt → tt
U41 :: tt → tt
U51 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s
U52 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s
U61 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
U62 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
U63 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
U64 :: tt → n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
s :: n__0:n__plus:n__s → n__0:n__plus:n__s
plus :: n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
n__0 :: n__0:n__plus:n__s
n__plus :: n__0:n__plus:n__s → n__0:n__plus:n__s → n__0:n__plus:n__s
n__s :: n__0:n__plus:n__s → n__0:n__plus:n__s
0' :: n__0:n__plus:n__s
hole_tt1_7 :: tt
hole_n__0:n__plus:n__s2_7 :: n__0:n__plus:n__s
gen_n__0:n__plus:n__s3_7 :: Nat → n__0:n__plus:n__s

Lemmas:
isNatKind(gen_n__0:n__plus:n__s3_7(n3066_7)) → tt, rt ∈ Ω(1 + n3066₇)

Generator Equations:
gen_n__0:n__plus:n__s3_7(0) ⇔ n__0
gen_n__0:n__plus:n__s3_7(+(x, 1)) ⇔ n__plus(gen_n__0:n__plus:n__s3_7(x), n__0)

No more defined symbols left to analyse.

(31) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
isNatKind(gen_n__0:n__plus:n__s3_7(n3066_7)) → tt, rt ∈ Ω(1 + n3066₇)

(32) BOUNDS(n^1, INF)